Graph-theoretic approach to symbolic analysis of linear descriptor systems
نویسندگان
چکیده
منابع مشابه
Discrete mode observability of structured switching descriptor linear systems: A graph-theoretic approach
The main result of the paper consists in graphical necessary and sufficient conditions which ensure the generic discrete mode observability of structured switching descriptor systems. The methods used in the previous studies on the observability of switching linear systems on standard form are not applicable to switching descriptor systems. So, we develop a new approach starting from bipartite ...
متن کاملObservability analysis for networked control systems: a graph theoretic approach
This paper deals with the state and input observability analysis for Networked Control Systems which are composed of interconnected subsystems that exchange data through communication networks. The proposed method is based on a graph-theoretic approach and assumes only the knowledge of the system’s structure. More precisely, for the so-called distributed decentralized and distributed autonomous...
متن کاملTowards Symbolic Analysis of Graph Transformation Systems
Graph transformation has recently become more and more popular as a general, rule-based visual specification paradigm to formally capture the operational semantics of modeling languages based on metamodeling techniques as demonstrated, by benchmark applications focusing on the formal treatment of the Unified Modeling Language (UML). In the paper, we propose a model checking-based verification a...
متن کاملGraph-Theoretic Analysis of Power Systems
We present an overview of the applications of graph theory in power system modeling, dynamics, coherency, and control. We first study synchronization of generator dynamics using both nonlinear and small-signal representations of classical structure-preserving models of power systems in light of their network structure and the weights associated with the nodes and edges of the network graph. We ...
متن کاملA unified approach to stability analysis of switched linear descriptor systems under arbitrary switching
We establish a unified approach to stability analysis for switched linear descriptor systems under arbitrary switching in both continuous-time and discrete-time domains. The approach is based on common quadratic Lyapunov functions incorporated with linear matrix inequalities (LMIs). We show that if there is a common quadratic Lyapunov function for the stability of all subsystems, then the switc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1994
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)90489-8